Derivation "Trees" and Parallelism in Chomsky-Type Grammars
نویسندگان
چکیده
منابع مشابه
Grammars with Restricted Derivation Trees
This extended abstract of the doctoral thesis studies theoretical properties of grammars with restricted derivation trees. After presenting the state of the art concerning this investigation area, the research is focused on the three main kinds of the restrictions placed upon the derivation trees. First, it introduces completely new investigation area represented by cut-based restriction and ex...
متن کاملMultidimensional trees and a Chomsky-Schützenberger-Weir representation theorem for simple context-free tree grammars
Weir [43] proved a Chomsky-Schützenberger-like representation theorem for the string languages of tree-adjoining grammars, where the Dyck language Dn in the Chomsky-Schützenberger characterization is replaced by the intersection D2n ∩ g(D2n), where g is a certain bijection on the alphabet consisting of 2n pairs of brackets. This paper presents a generalization of this theorem to the string lang...
متن کاملImplementing The Generalized Word Order Grammars Of Chomsky And Diderichsen
Many of the insights of Transformational Grammar (TG) concern the movability of const i tuents . But in recent versions (Government & Binding, GB; cf. Chomsky, 1982, Sells,1985) the sentence representations (trees) include both the site of the moved constituent and the site from where it has been moved; the original site of the moved constituent is marked as a trace (t) or empty (e, []). In the...
متن کاملLearning Chomsky-like Grammars for Biological Sequence Families
This paper presents a new method of measur ing performance when positives are rare and investigates whether Chomsky like grammar representations are useful for learning accu rate comprehensible predictors of members of biological sequence families The positive only learning framework of the Inductive Logic Programming ILP system CProgol is used to generate a grammar for recognis ing a class of ...
متن کاملCoalgebras, Trees, and Grammars
This paper is a contribution to discussions of the mathematical background of MTS, including formalizations of all the basic notions in the subject. The main point is that work in coalgebra in the past five years has developed a body of results which already has been applied to automata theory and formal language theory and which also might be fruitfully applied to MTS. This paper is a note pri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Triangle
سال: 2018
ISSN: 2013-939X
DOI: 10.17345/triangle8.101-120